Unsound Inferences Make Proofs Shorter
نویسندگان
چکیده
We give examples of calculi that extend Gentzen’s sequent calculus LK by unsound quantifier inferences in such a way that (i) derivations lead only to true sequents, and (ii) proofs therein are non-elementarily shorter than LK-proofs.
منابع مشابه
Exploiting the Addressee's Inferential Capabilities in Presenting Mathematical Proofs
Proof presentation systems and, in some more general context, many natural language generation systems suffer from a crucial problem: they present too much information explicitly which the intended audience could more naturally infer from a less detailed text. Moreover, proofs in mathematical textbooks make extensive use of building chains of inferences in specialized notations, which is not su...
متن کاملThe Effect of Self-Regulation on Improving EFL Readers’ Ability to Make Within-Text Inferences
Self-regulation is the ability to regulate one’s cognition, behavior, actions, and motivation strategically and autonomously in order to achieve self-set goals including the learning of academic skills and knowledge. Accordingly, self-regulated learning involves self-generated and systematic thoughts and behaviors with the aim of attaining learning goals. With that in mind, this study aimed to ...
متن کاملBenchmarking Ontology-Based Query Rewriting Systems
Query rewriting is a prominent reasoning technique in ontology-based data access applications. A wide variety of query rewriting algorithms have been proposed in recent years and implemented in highly optimised reasoning systems. Query rewriting systems are complex software programs; even if based on provably correct algorithms, sophisticated optimisations make the systems more complex and erro...
متن کاملSemantic Derivation Verification: Techniques and Implementation
Automated Theorem Proving (ATP) systems are complex pieces of software, and thus may have bugs that make them unsound. In order to guard against unsoundness, the derivations output by an ATP system may be semantically verified by trusted ATP systems that check the required semantic properties of each inference step. Such verification needs to be augmented by structural verification that checks ...
متن کاملSemantic Derivation Verification
Automated Theorem Proving (ATP) systems are complex pieces of software, and thus may have bugs that make them unsound. In order to guard against such unsoundness, the derivations output by an ATP system may be semantically verified by a trusted system that checks the required semantic properties of each inference step. Such verification may need to be augmented by structural verification that c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1608.07703 شماره
صفحات -
تاریخ انتشار 2016